CePO #1
Open
CePO #1
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
|
Do we also want to maybe edit the |
This will allow users to do the following: 1. Cli where if they can pass in anything that's "cepo_<name-of-attribute>" 2. Yaml file where if they pass it in as "<name-of-attribute>" 3. If none of them have a specific attribute, we use the default setting 4. If both of them have the specific attribute, we error out
erich-cerebras
approved these changes
Dec 19, 2024
Add modification of CePO configs through yaml and cli arguments
ivanl-cerebras
approved these changes
Jan 2, 2025
…ass for single source of truth
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Adding Cerebras Planning and Optimization (CePO). On high-level, in CePO, we make m attempts to generate n step-by-step plans, refine the plans, check inconsistencies between them, use the above feedback to generate the final plan and produce the answer. This process is them repeated N times in a classical best of n manner.